Series-parallel languages on scattered and countable posets
نویسندگان
چکیده
منابع مشابه
Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets
We prove the closure under complementation of the class of languages of scattered and countable N-free posets recognized by branching automata. The proof relies entirely on effective constructions.
متن کاملInfinite Series-Parallel Posets: Logic and Languages
We show that a set of uniformly width-bounded infinite seriesparallel pomsets is ω-series-rational iff it is axiomatizable in monadic second order logic iff it is ω-recognizable. This extends recent work by Lodaya and Weil on sets of finite series-parallel pomsets in two aspects: It relates their notion of series-rationality to logical concepts, and it generalizes the equivalence of recognizabi...
متن کاملSeries-Parallel Posets: Algebra, Automata and Languages
In order to model concurrency, we extend automata theory from the usual word languages (sets of labelled linear orders) to sets of labelled series-parallel posets | or, equivalently, to sets of terms in an algebra with two product operations: sequential and parallel. We rst consider languages of posets having bounded width, and characterize them using depth-nilpotent algebras. Next we introduce...
متن کاملLogic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings
In this paper we consider languages of labelled N -free posets over countable and scattered linear orderings. We prove that a language of such posets is series-rational if and only if it is recognizable by a finite depth-nilpotent algebra if and only if it is bounded-width and monadic second-order definable. This extends previous results on languages of labelled N -free finite and ω-posets and ...
متن کاملRetractions onto series-parallel posets
The poset retraction problem for a poset P is whether a given poset Q containing P as a subposet admits a retraction onto P, that is, whether there is a homomorphism from Q onto P which fixes every element of P. We study this problem for finite series-parallel posets P. We present equivalent combinatorial, algebraic, and topological charaterisations of posets for which the problem is tractable,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.01.016